A New Approach to Mutual Exclusion for Tackling Selfish Nodes in a Distributed Spectrum

In distributed systems, it is difficult to predict whether the node is genuine or not and this may lead to the addition of selfish/ malicious nodes. The selfish/malicious nodes are the nodes that continue the execution of their codes for unknown/prolonged duration. For allotting the nodes with resources, the mutual exclusion algorithms, either token based, non-token based quorum-based or agreement based, do not keep check over the sites requesting execution. The selfish nodes try to sabotage the processing in the network by acquiring the resources. Hence, presence of a gap is observed from the point of view of security in the distributed systems. Therefore, to make the network resilient enough to prevent itself from these attacks, here we are proposing an algorithm which is an extension to the current algorithms, for allocation of resources to the nodes and execution of their requests with certain modifications in the request queue and its execution by using priority queue and round–robin scheduling for execution of all the sites in the distributed system. This will make the distributed systems safe from the execution of requests by malicious nodes and will work for both the monitored and the automated networks in the distributed environment.